Query optimization by simulated annealing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization by simulated annealing.

There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...

متن کامل

Optimization of Distillation Column Operation by Simulated Annealing

Abstract: In this paper, an exergy analysis approach is proposed for optimal design of distillation column by using simulated annealing algorithm. First, the simulation of a distillation column was performed by using the shortcut results and irreversibility in each tray was obtained. The area beneath the exergy loss profile was used as Irreversibility Index in the whole column. Then, First Opti...

متن کامل

Construction Scheduling Optimization by Simulated Annealing

The process of generating optimized schedules for construction projects is a very time-consuming. For each construction task several execution restrictions, conditions and requirements such as technological dependencies or resource availabilities have to be considered. This leads to a multitude of possible execution orders and consequently to a hard optimization problem. Within this paper the i...

متن کامل

Simulated Annealing and Global Optimization

Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...

متن کامل

Robust optimization with simulated annealing

Complex systems can be optimized to improve the performance with respect to desired functionalities. An optimized solution, however, can become suboptimal or even infeasible, when errors in implementation or input data are encountered. We report on a robust simulated annealing algorithm that does not require any knowledge of the problems structure. This is necessary in many engineering applicat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMOD Record

سال: 1987

ISSN: 0163-5808

DOI: 10.1145/38714.38722